Permutation decoding: Towards an approach using algebraic properties of the σ-subcode
نویسنده
چکیده
In this paper, we show a manner to use properties of the permutation group on some binary linear codes to improve the decoding algorithms. We search especially for particular permutations and we prove bounds on dimension of a special subcode of the idempotent subcode. This σ-subcode can have very lower dimension in practice than the original code. We give several examples at the end and explain what can be the gain with this way of decoding.
منابع مشابه
On the Security of Some Compact Keys for McEliece Scheme
In this paper we study the security of the key of compact McEliece schemes based on alternant/Goppa codes with a non-trivial permutation group, in particular quasicyclic alternant codes. We show that it is possible to reduce the key-recovery problem on the original quasi-cyclic code to the same problem on a smaller code derived from the public key. This result is obtained thanks to the invarian...
متن کاملGeneralized subspace subcodes with application in cryptology
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode method, which leads to Alternant codes and Goppa codes over the underlying prime field, or over some intermediate subfield. The main advantages of these constr...
متن کاملOptimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets
We construct a new list-decodable family of asymptotically good algebraic-geometric (AG) codes over fixed alphabets. The function fields underlying these codes are constructed using class field theory, specifically Drinfeld modules of rank 1, and designed to have an automorphism of large order that is used to “fold” the AG code. This generalizes earlier work by the first author on folded AG cod...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملOptimal rate algebraic list decoding using narrow ray class fields
We use class field theory, specifically Drinfeld modules of rank 1, to construct a family of asymptotically good algebraic-geometric (AG) codes over fixed alphabets. Over a field of size l, these codes are within 2/( √ l − 1) of the Singleton bound. The functions fields underlying these codes are subfields with a cyclic Galois group of the narrow ray class field of certain function fields. The ...
متن کامل